Optimal stopping problems by two or more decision makers: a survey

A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers, the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe some dynamic approaches. Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn.     

高能核碰撞中带电多重数快度与能量和中心度的关系

用强子–弦级联模型JPCIAE及相应的Monte Carlo事例产生器研究相对论性核–核碰撞中带电粒子多重数的赝快度密度对能量和中心度的依赖关系.无需另调任何模型参数的条件下,此模型可以同时较好地描述相对论性pp实验数据及PHOBOS和PHENIX实验组的Au+Au实验数据.本文指出:因〈N_part〉并非严格定义的物理量,致使实验上和理论上确定〈N_part〉有一定任意性,从而使得每参加者核子对的带电粒子赝快度密度随着〈N_part〉的增加可能逐渐增大,也可能逐渐减小,因此用它来区分粒子产生机制是欠妥的.     

Monstrous Branes

 We study D-branes in the bosonic closed string theory whose automorphism group is the Bimonster group (the wreath product of the Monster simple group with ℤ₂). We give a complete classification of D-branes preserving the chiral subalgebra of Monster invariants and show that they transform in a representation of the Bimonster. Our results apply more generally to self-dual conformal field theories which admit the action of a compact Lie group on both the left- and right-moving sectors. Received: 20 February 2002 / Accepted: 17 August 2002 Published online: 19 December 2002 Communicated by R.H. Dijkgraaf     

A duality relation for busy cycles inGI/G/1 queues

Using a generalization of the classical ballot theorem, Niu and Cooper [7] established a duality relation between the joint distribution of several variables associated with the busy cycle inM/G/1 (with a modified first service) and the corresponding joint distribution of several related variables in its dualGI/M/1. In this note, we generalize this duality relation toGI/G/1 queues with modified first services; this clarifies the original result, and shows that the generalized ballot theorem is superfluous for the duality relation.     

On Donaldson’s flow of surfaces in a hyperkähler four-manifold

We prove some basic properties of Donaldson’s flow of surfaces in a hyperkähler 4-manifold. When the initial submanifold is symplectic with respect to one Kähler form and Lagrangian with respect to another, we show that certain kinds of singularities cannot form, and we prove a convergence result under a condition related to one considered by M.-T. Wang for the mean curvature flow.     

SHS等离子喷涂制备FeAl2O4-Al2O3-Fe纳米复合涂层的研究

利用SHS等离子喷涂技术,将经过机械团聚法制备的Fe2O3-Al复合粉体送入等离子焰流,沉积出厚度约为400 μm的复合涂层.利用XRD,SEM 和TEM等检测手段对涂层的成分和组织进行了分析,测定了涂层的显微硬度、断裂韧性以及耐磨性.结果表明涂层为具有纳米结构的FeAl2O4-Al2O3-Fe纳米复合组织;涂层的显微硬度为HV100g870;断裂韧性是普通Al2O3涂层的2倍;无润滑磨损的耐磨性是普通Al2O3涂层的2.5倍.     

Robust locally testable codes and products of codes

We continue the investigation of locally testable codes, i.e., error‐correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on local testability: First, motivated by the recently proposed notion of robust probabilistically checkable proofs, we introduce the notion of robust local testability of codes. We relate this notion to a product of codes introduced by Tanner and show a very simple composition lemma for this notion. Next, we show that codes built by tensor products can be tested robustly and somewhat locally by applying a variant of a test and proof technique introduced by Raz and Safra in the context of testing low‐degree multivariate polynomials (which are a special case of tensor codes). Combining these two results gives us a generic construction of codes of inverse polynomial rate that are testable with poly‐logarithmically many queries. We note that these locally testable tensor codes can be obtained from any linear error correcting code with good distance. Previous results on local testability, albeit much stronger quantitatively, rely heavily on algebraic properties of the underlying codes. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

基于半导体光放大器进行光标签提取的性能分析

利用半导体光放大器增益饱和数学模型，第一次分析了基于单个半导体放大器进行光标签提取的节点性能.通过对半导体光放大器的参量分析和优化，仿真显示，对于标签速率2.5 Gb/ s 、净荷速率40 Gb/s 的光分组包，提取的标签消光比可达到13 dB.